A New Genetic Algorithm for the Multi-Mode Resource-Constrained Project Scheduling Problem

نویسنده

  • Javier Alcaraz
چکیده

In this paper we propose a robust genetic algorithm for the multi-mode resourceconstrained project scheduling problem. We present a new representation for the solutions to this problem, which includes an additional bit indicating the scheduling scheme used to construct the schedule, forward or backward. Moreover, we have developed new genetic operators which operate over this representation, exploiting and combining the information in an efficient way. We have designed a new crossover procedure, the two-point forward-backward crossover, and have adapted a mechanism used in a simulated annealing algorithm as a mutation operator in genetic algorithms. Computational results on the standard sets of PSPLIB show the good performance of our algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

An Evolutionary Algorithm Based on a Hybrid Multi-Attribute Decision Making Method for the Multi-Mode Multi-Skilled Resource-constrained Project Scheduling Problem

This paper addresses the multi-mode multi-skilled resource-constrained project scheduling problem. Activities of real world projects often require more than one skill to be accomplished. Besides, in many real-world situations, the resources are multi-skilled workforces. In presence of multi-skilled resources, it is required to determine the combination of workforces assigned to each activity. H...

متن کامل

A Genetic Algorithm and a Model for the Resource Constrained Project Scheduling Problem with Multiple Crushable Modes

Abstract: This paper presents an exact model and a genetic algorithm for the multi-mode resource constrained project scheduling problem with generalized precedence relations in which the duration of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. All resources considered are renewable. The objective is to determine a mode, ...

متن کامل

A New Bi-Objective Model for a Multi-Mode Resource-Constrained Project Scheduling Problem with Discounted Cash Flows and four Payment Models

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

An Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems

In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001